s=[*input()]+[" "]
for i in range(1,len(s)-1):
if s[i]==s[i-1]:
for j in "abc":
if j!=s[i-1] and j!=s[i+1]:
s[i]=j
break
print("".join(s))
#include <bits/stdc++.h>
using namespace std;
int small[100005], big[100005];
int main()
{
int result, len, cnt, i, j;
string str, res="";
char ch;
cin>>str;
len = str.length();
for(i=0;i<len;i++){
// printf("%d ",i);
if(str[i]== str[i+1]){
if(i+2<len){
if(str[i] == 'z') ch = 'a';
else ch = str[i]+1;
while(1){
if(ch == 'z') ch = 'a';
if(str[i+2] != ch && str[i] != ch){
res += str[i];
res += ch;
i++;
break;
} else{
ch++;
}
}
}else {
// printf("Else in 2nd level:\t");
if(str[i] == 'z') ch = 'a';
else ch = 'z';
res += str[i];
res += ch;
i++;
break;
}
}
else{
res += str[i];
}
}
// printf("\n");
cout<<res;
}
1476E - Pattern Matching | 1107A - Digits Sequence Dividing |
1348A - Phoenix and Balance | 1343B - Balanced Array |
1186A - Vus the Cossack and a Contest | 1494A - ABC String |
1606A - AB Balance | 1658C - Shinju and the Lost Permutation |
1547C - Pair Programming | 550A - Two Substrings |
797B - Odd sum | 1093A - Dice Rolling |
1360B - Honest Coach | 1399C - Boats Competition |
1609C - Complex Market Analysis | 1657E - Star MST |
1143B - Nirvana | 1285A - Mezo Playing Zoma |
919B - Perfect Number | 894A - QAQ |
1551A - Polycarp and Coins | 313A - Ilya and Bank Account |
1469A - Regular Bracket Sequence | 919C - Seat Arrangements |
1634A - Reverse and Concatenate | 1619C - Wrong Addition |
1437A - Marketing Scheme | 1473B - String LCM |
1374A - Required Remainder | 1265E - Beautiful Mirrors |